public class MinCostClimbingStairs {
    // https://leetcode.cn/problems/min-cost-climbing-stairs/
    class Solution {
        public int minCostClimbingStairs(int[] cost) {
            int [] dp = new int[cost.length + 1];
            // dp[i] : 表示到第i层楼最少花费
            dp[0] = 0;
            dp[1] = 0;
            for(int i = 2; i <= cost.length ; i ++)
            {
                dp[i] = Math.min(dp[i-2] + cost[i-2],dp[i-1] + cost[i-1]);

            }
            return dp[cost.length];

        }
    }
}
